Search results for "Bondareva–Shapley theorem"

showing 3 items of 3 documents

Robust Allocation Rules in Dynamical Cooperative TU Games

2011

Robust dynamic coalitional TU games are repeated TU games where the values of the coalitions are unknown but bounded variables. We set up the game supposing that the Game Designer uses a vague measure of the extra reward that each coalition has received up to the current time to re-adjust the allocations among the players. As main result, we provide a constructive method for designing allocation rules that converge to the core of the average game. Both the set up and the solution approach also provide an insight on commonalities between coalitional games and stability theory.

Bondareva–Shapley theoremgame theoryMathematical optimizationSequential gameComputer scienceComputingMilieux_PERSONALCOMPUTINGCombinatorial game theoryTheoryofComputation_GENERALConstructiveBounded functionRepeated gameVideo game designGame theoryMathematical economics
researchProduct

Dynamic Coalitional TU Games: Distributed Bargaining among Players' Neighbors

2013

We consider a sequence of transferable utility (TU) games where, at each time, the characteristic function is a random vector with realizations restricted to some set of values. The game differs from other ones in the literature on dynamic, stochastic or interval valued TU games as it combines dynamics of the game with an allocation protocol for the players that dynamically interact with each other. The protocol is an iterative and decentralized algorithm that offers a paradigmatic mathematical description of negotiation and bargaining processes. The first part of the paper contributes to the definition of a robust (coalitional) TU game and the development of a distributed bargaining protoc…

Mathematical optimizationComputer Science::Computer Science and Game TheorySequential gameComputer scienceCombinatorial game theoryExample of a game without a valueFOS: MathematicsSimultaneous gameElectrical and Electronic EngineeringTransferable utilityMathematics - Optimization and ControlGame theoryBondareva–Shapley theoremBargaining problemNon-cooperative gameUtility theoryStochastic gameComputingMilieux_PERSONALCOMPUTINGScreening gameComputer Science ApplicationsBargaining processCore (game theory)Control and Systems EngineeringOptimization and Control (math.OC)Repeated gameSettore MAT/09 - Ricerca OperativaoptimizationMathematical economicsGame theory
researchProduct

Robust dynamic cooperative games

2009

Classical cooperative game theory is no longer a suitable tool for those situations where the values of coalitions are not known with certainty. Recent works address situations where the values of coalitions are modelled by random variables. In this work we still consider the values of coalitions as uncertain, but model them as unknown but bounded disturbances. We do not focus on solving a specific game, but rather consider a family of games described by a polyhedron: each point in the polyhedron is a vector of coalitions’ values and corresponds to a specific game. We consider a dynamic context where while we know with certainty the average value of each coalition on the long run, at each t…

Statistics and ProbabilityBondareva–Shapley theoremEconomics and EconometricsNon-cooperative gameComputer Science::Computer Science and Game TheoryMSC-91A12Sequential gameMSC-91A25Computer scienceCooperative games Dynamic games Joint replenishmentCombinatorial game theoryTheoryofComputation_GENERALCooperative game theoryMETIS-263773Computer Science::Multiagent SystemsMathematics (miscellaneous)Example of a game without a valueEWI-15215Repeated gameIR-62781Simultaneous gameStatistics Probability and UncertaintyMathematical economicsSocial Sciences (miscellaneous)International journal of game theory
researchProduct